System and method for dynamic scaling of LDPC decoder in a solid state drive

ABSTRACT

In some embodiments of the present invention, a data storage device includes a controller and a memory. The data storage device further includes an LDPC encoder and decoder, with the decoder implementing a dynamic precision-rescaling technique for improving performance. In one embodiment, the technique works by rescaling the binary representations of the input log-likelihood ratios (LLRs) and messages upon activation of decoder-state-based triggers. Various triggering functions are introduced, e.g., checking if the number of output LLRs smaller than a certain limit crosses a threshold, checking if the weight of a syndrome crosses a threshold, etc. This technique offers an improvement in the performance of the decoder.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of Ser. No. 14/722,673, filed on May 27, 2015, which is a continuation of U.S. patent application Ser. No. 13/842,956, filed on Mar. 15, 2013, now U.S. Pat. No. 9,059,742, each of the above applications being hereby expressly incorporated herein by reference in their entirety.

BACKGROUND

Technical Field

This disclosure relates to data storage devices for computer systems. More particularly, the disclosure relates to dynamical scaling in a decoder in a data storage device.

Description of the Related Art

Both volatile and non-volatile memory can introduce errors in the stored data. To protect user data stored in memory from corruption, parity data can be determined and stored along with user data to facilitate error detection and/or correction. Low Density Parity Code (LDPC) is becoming an increasingly common way for providing error correction.

BRIEF DESCRIPTION OF THE DRAWINGS

Systems and methods that embody the various features of the invention will now be described with reference to the following drawings, in which:

FIG. 1A illustrates a data storage device that dynamically scales soft information such as log-likelihood ratios (LLRs) according to one embodiment of the invention.

FIGS. 1B-1D illustrate the various types of memory that could be present in the data storage device in some embodiments.

FIG. 2 is a simplified block diagram illustrating a dynamic scaling mechanism in a decoder according to one embodiment of the invention.

FIG. 3 shows an example decoder with a dynamic scaling mechanism according to one embodiment of the invention.

FIG. 4 is a flow diagram illustrating a process of dynamic scaling according to one embodiment of the invention.

DETAILED DESCRIPTION OF SPECIFIC EMBODIMENTS

While certain embodiments are described, these embodiments are presented by way of example only, and are not intended to limit the scope of protection. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms. Furthermore, various omissions, substitutions, and changes in the form of the methods and systems described herein may be made without departing from the scope of protection.

In some embodiments, “coding” or “to code” data as used in this disclosure refer to the process of encoding data and/or the process of decoding data.

Overview

In some embodiments of the present invention, a data storage device includes a controller and a memory, which may include (1) non-volatile memory such as solid-state memory (e.g., NAND) and magnetic media commonly used in hard disk drives, (2) volatile memory such as a random access memory (e.g., DRAM, SRAM), or (3) a mix of both non-volatile and volatile memory. The data storage device further includes an LDPC encoder and decoder, with the decoder implementing a dynamic precision-rescaling technique for improving performance. In one embodiment, the technique works by rescaling the binary representations of the input log-likelihood ratios (LLRs) and messages upon activation of decoder-state-based triggers. Messages can be broadly defined as a scalar of an estimated reliability representing a single unit of data (typically in a binary case) or a vector of an estimated reliability representing a single unit of data (typically in a non-binary case). Various triggering functions are introduced, e.g., checking if the number of output LLRs smaller than a certain limit crosses a threshold, checking if the weight of a syndrome crosses a threshold, etc. This technique offers an improvement in the performance of the decoder.

System Overview

FIG. 1A illustrates a data storage device 120 according to one embodiment of the invention. As is shown, a data storage device 120 (e.g., hybrid hard drive, solid state drive, etc.) includes a controller 130 and a memory 140.

The controller 130 can receive data and/or storage access commands from a storage interface module 112 (e.g., a device driver) in a host system 110. Storage access commands communicated by the storage interface 112 can include write and read commands issued by the host system 110. The commands can specify a logical block address in the data storage device 120, and the controller 130 can execute the received commands in the memory 140.

The data storage device 120 can store data received from the host system 110 so that the data storage device 120 can act as memory storage for the host system 110. To facilitate this function, the controller 130 can implement a logical interface. The logical interface can present to the host system 110 storage device memory as a set of logical addresses (e.g., contiguous address) where data can be stored. Internally, the controller 130 can map logical addresses to various physical memory addresses in the memory 140 and/or other memory module(s).

The controller 130 includes an LDPC encoder 158 and LDPC decoder module 162. In one embodiment, the encoder 158 encodes data (e.g., user data) to be written to the memory. For example, data may be written to pages, such as E-pages, of a non-volatile solid-state memory array. The encoder 158 may dynamically use different coding parameters to accommodate changing condition of the memory. Similarly, the decoder 162 decodes data read from the memory pages and can similarly use different coding parameters in the decoding. In other embodiments, the data storage device may use other types of encoders and decoders (e.g., soft decision decoding of Reed-Solomon codes, polar decoders, etc.). For the purpose of illustration, the dynamic scaling mechanism will be described within the context of a LDPC decoder below.

FIG. 1B shows that memory 140 may include a non-volatile solid-state memory array, which comprises one or more blocks of storage, identified as Block “A” 142 through Block “N”. Each block comprises a plurality of flash pages (F-pages). For example, Block A 142 of FIG. 1B includes a plurality of F-pages, identified as F-pages A 153, B, through N. In some embodiments, each “F-page” is a smallest grouping of memory cells in the non-volatile solid-state memory array that can be programmed in a single operation or as a unit. Further, each F-page includes a plurality of error correcting code pages (E-pages). In the illustrated embodiment, each F-page includes four E-pages that are illustrated as four boxes, including E-page 144. Other embodiments may use F-pages or E-pages that are defined differently or each F-page may include greater or fewer than four E-pages. FIG. 1C shows that memory 140 may include magnetic media commonly used in hard disk drives, while FIG. 1D shows that memory 140 may include volatile memory such as SRAM or DRAM. In a hybrid hard drive, data may be stored in magnetic media in addition to the non-volatile solid-state memory array.

Dynamic Resealing

FIG. 2 is a block diagram illustrating the dynamic scaling mechanism in the decoder according to one or more embodiments. As previous described, the LDPC decoder 162 is configured to decode data read from the memory. Those skilled in the art will recognize that FIG. 2 is a simplified, conceptual block diagram showing the components involved in the dynamic scaling of soft information and may thus omit components commonly found in an LDPC decoder.

Decoding of LDPC codes is typically done by an iterative algorithm in which messages indicating bit likelihoods (LLRs) are exchanged between variables and check nodes. The goal is to arrive at a point where the bit values are delineated (e.g., each bit divert to a “0” or “1”). During decoding, these messages are repeatedly added to and subtracted from the LLRs.

As shown in FIG. 2, LDPC decoder 162 includes an iterative unit 202, a trigger unit 204, and a scaling unit 206. The iterative unit 202 is configured to perform iterations of the decoding algorithm using messages, e.g., with each iteration being performed based on the LLRs from a prior iteration in the manner described above.

Decoders are typically based on some fixed-point implementations. In such fixed-point implementations, a common occurrence is the saturation of the output LLRs (and consequently the exchanged messages), which in turn degrades decoder performance, leading to the so-called “error floor” behavior. It has been shown that even as signal-to-noise ratio (SNR) improves, the saturation effect remains.

Some embodiments of the invention overcome such “error floor” behavior by dynamically scaling messages (e.g., output LLRs) during the iterations when certain trigger conditions are met. These trigger conditions may be based on internal states of the decoder and/or monitored decoder-related parameters. In particular, with reference to FIG. 2, the scaling unit 206 is configured to scale messages (e.g., LLRs) from the iterative unit 202 when the trigger unit 204 detects the occurrence of one or more trigger conditions. In one embodiment, the trigger unit is configured to detect one or more trigger conditions based at least in part on one or more inputs received from components within the decoder, with the inputs reflecting one or more internal states of the decoder. The scaled messages (e.g., LLRs) are then used as input to the iterative unit 202 for a next iteration. If no scaling is triggered, the scaling unit 206 acts as a pass through and the LLRs are sent to the iterative unit 202 without scaling. The trigger unit 204 is configured to detect one or more trigger conditions based on one or more inputs received from components within the LDPC decoder. These inputs may reflect one or more internal states of the LDPC decoder.

FIG. 3 shows an example decoder with the dynamic scaling mechanism according to one embodiment of the invention. The example decoder expands upon the simplified representation shown in FIG. 2. The design of the decoder embodiment shown in FIG. 3 is based on a “min-sum” or “sum-product” type decoder. In one embodiment, the decoder is configured to work with a multi-layer parity check matrix, in which case the decoder is a layered decoder.

Like the simplified decoder representation in FIG. 2, in the example LDPC decoder embodiment of FIG. 3 rescaling is also initiated by a trigger unit 204 a, which controls multiplexers 204 b and 204 c. The triggering function in one embodiment is based at least on inputs from one or more sources. As shown, the three example inputs include: (1) messages entering the check-node unit (302), (2) the syndrome of the codeword at the end of each iteration (304), and (3) output LLRs entering the APP (a posteriori) memory (306). Some embodiments may include one or more of the three example inputs and/or other inputs.

In some embodiments, the trigger function uses one or more of the aforementioned inputs to determine if rescaling of the output LLRs and messages is required. Some examples of triggers include:

-   -   1) Scale/Rescale if the weight of the syndrome (number of         unsatisfied checks) is less than a threshold (the threshold may         be optimized for various requirements). In a fixed-point         implementation, it has been observed that the saturation problem         tends to occur when the weight of the syndrome reaches a low         value. In one embodiment, this trigger is delayed until         saturation is detected, because it has been observed that a         pre-mature triggering based on this condition has an adverse         effect on performance, as scaling discards some information that         may be important in the early stages of decoding. In one         embodiment, the threshold could be in range of 0.1-9.9% of all         checks being unsatisfied checks.     -   2) Scale/Rescale if the number of output LLRs greater than a set         limit is more than a threshold. In one embodiment, if the         absolute values of a predetermined number of LLRs are greater         than a set limit, the trigger condition is met and the LLR         values are scaled down.     -   3) Scale/Rescale if the number of messages that are saturated is         greater than a threshold. In one embodiment, this is based on         the input to the check node unit (which translates to the input         302 to the trigger unit 204).     -   4) Scale/Rescale if a preset number of iterations is reached. In         one embodiment, the decoder could be configured to trigger         rescaling when a preset number of iterations is reached (e.g.,         5). In another embodiment, a preset minimum number of iterations         has to be performed before a rescaling can occur.     -   5) Rescale if the number of iterations since the last rescale         has reached a threshold. It has been observed that after a         scaling, it is beneficial to allow a certain number of         iterations to occur before another scaling is performed. So in         one embodiment, there is a minimum number of iterations required         following a previous rescaling before a rescaling can take         place.     -   6) Any conditions that are compounds of the above conditions.         This could be, e.g., scale/rescale if (i) the weight of the         syndrome <15, AND (ii) the last rescaling (if it happened) was         done more than 5 iterations before.

In the decoder embodiment of FIG. 3, the scaling unit 206 includes a shifter 206 a. When the trigger function detects a condition that triggers scaling, the shifter 206 a in one embodiment is configured to right shift (with rounding or truncating) the LLR (LLR_(out)) coming from the APP Memory 310. The right shifting, when followed by truncation or rounding, reduces the numerical range spanned by the LLR, thereby reducing the number of bits required to represent it. Note that in the first iteration, the initial LLR_(in) may come from a detector such as a Soft-Output Viterbi Algorithm (SOVA) detector into multiplexer 320 and is selected for use. The scaled LLR_(out) is then sent to adder 312, where R_(old) (prior messages stored in R memory 316) is subtracted from it, and the result is sent to Q FIFO 314, as well as an alpha multiplier 322 and a threshold 324. In one embodiment, the alpha value of the alpha multiplier 322 is a fixed value that is used to adjust the LLRs for performance reasons and the threshold 324 is used for rounding operation after the alpha multiplier is applied, so that the output after the alpha multiplier application maintains the same number of bits or has a fewer number of bits.

In one embodiment, at each iteration, the check node unit 208 receives inputs from the variable nodes and sends an update to each variable node. The function of the R Memory loop (marked by adder 312 and adder 328) is to screen out certain updates to the check nodes, such that a check node does not receive its own update. The R Memory itself (330) stores the update from the prior iteration out of the check node unit 208 (R_(new)). To accomplish this, in one embodiment R_(new) from the check node unit 208 is added to the LLR_(out) at the current iteration (at adder 328) and R_(old) (which is R_(new) from a prior iteration) is subtracted from the LLR_(out) at the next iteration (at adder 312). In other embodiments, the R Memory loop may be implemented in a different manner to accomplish the same goal.

At each iteration, the layers of the parity check matrix are processed one layer at a time. For the purpose of this disclosure, the processing of each layer will be referred to as a sub-iteration. In one embodiment, after the last sub-iteration on the last layer, the APP Memory 310 contains the output LLRs from a full iteration. The following example illustrates the scaling operation. Let:

-   -   i denotes the current iteration;     -   l denotes the current sub-iteration (the current layer being         processed); and     -   i.l denotes the ith iteration and the lth sub-iteration.

Assume that there are four layers in the matrix, and the i and l indices start at 1 instead of 0. In one embodiment, the decoder starts by processing through sub-iterations 1.1, 1.2, 1.3, and 1.4. At the end of sub-iteration 1.4, the trigger unit may decide that a condition for scaling is met and trigger the scaling. It will scale the output of the APP Memory 310 and the output of the R Memory 330. This is accomplished at sub-iteration 2.1 through control of the multiplexers 204 b and 204 c. At sub-iterations 2.2, 2.3, and 2.4 the multiplier 204 c is configured so that output of the R Memory 330 will continue to be scaled to ensure that outputs from previous layers are also scaled, but the multiplier 204 b is otherwise configured to not scale the output of the APP Memory 310. Once the iteration/sub-iteration 2.4 ends, then both scaling will be turned off (assuming a trigger condition is not present again). In one embodiment, the decision to turn on the scaling is made at the end of each iteration i, and once the scaling decision is triggered, scaling of the APP Memory outputs is performed as the LLR enters the first sub-iteration of the next iteration (i+1) as it begins, and the scaling of the R Memory outputs are performed during each sub-iteration of iteration i+1.

FIG. 4 is a flow diagram illustrating a process 400 of dynamic scaling according to one embodiment of the invention. The process starts at block 402 where a decoding iteration is performed. This may be a part of performing several iterations of decoding by using messages, as described above. Then a detection/check at 404 is performed to determine if the decoding is complete. If so, the decoding process terminates. Otherwise, a check of the rescaling conditions is performed at block 406 to determine if the rescaling is triggered. The detecting of one or more trigger conditions could be based at least in part on one or more inputs received from components within the decoder, the inputs reflecting one or more internal states of the decoder. The various trigger conditions include those described above. If the occurrence of the one or more trigger conditions is detected in a current iteration, the messages are scaled/rescaled at block 408 and the next iteration is performed at block 402 with the scaled messages as input. If the rescaling has not been triggered the LLRs and messages are passed into the next iteration without scaling.

Other Variations

Those skilled in the art will appreciate that in some embodiments, other approaches and methods can be used. For example, although the example embodiments are described in the context of an LDPC decoder, the embodiments are applicable to iterative decoders other than LDPC decoders such as soft decision decoding of Reed-Solomon codes, polar decoders, etc. As another example, the non-volatile solid-state memory array can be implemented using NAND flash memory devices. Other types of solid-state memory devices can alternatively be used, such as array of flash integrated circuits, Chalcogenide RAM (C-RAM), Phase Change Memory (PC-RAM or PRAM), Programmable Metallization Cell RAM (PMC-RAM or PMCm), Ovonic Unified Memory (OUM), Resistance RAM (RRAM), NOR memory, EEPROM, Ferroelectric Memory (FeRAM), Magnetoresistive RAM (MRAM), other discrete NVM (non-volatile solid-state memory) chips, or any combination thereof. In one embodiment, the non-volatile solid-state memory array preferably includes multi-level cell (MLC) devices having multi-level cells capable of storing more than a single bit of information, although single-level cell (SLC) memory devices or a combination of SLC and MLC devices may be used. In one embodiment, the data storage device 120 can include other memory modules, such as one or more magnetic memory modules.

While certain embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the protection. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms. Furthermore, various omissions, substitutions and changes in the form of the methods and systems described herein may be made without departing from the spirit of the protection. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of the protection. For example, the systems and methods disclosed herein can be applied to hard disk drives, hybrid hard drives, and the like. In addition, other forms of storage (e.g., DRAM or SRAM, battery backed-up volatile DRAM or SRAM devices, EPROM, EEPROM memory, etc.) may additionally or alternatively be used. As another example, the various components illustrated in the figures may be implemented as software and/or firmware on a processor, ASIC/FPGA, or dedicated hardware.

Also, the features and attributes of the specific embodiments disclosed above may be combined in different ways to form additional embodiments, all of which fall within the scope of the present disclosure. Although the present disclosure provides certain preferred embodiments and applications, other embodiments that are apparent to those of ordinary skill in the art, including embodiments which do not provide all of the features and advantages set forth herein, are also within the scope of this disclosure. Accordingly, the scope of the present disclosure is intended to be defined only by reference to the appended claims. 

What is claimed is:
 1. A decoder, the decoder configured to: exchange, during each of a plurality of iterations, a plurality of messages between a plurality of variable nodes and a plurality of check nodes, each message indicating a degree of reliability in an observed outcome of data; determine a current operating condition of the decoder; for each of the iterations: scale the respective message when the current operating condition of the decoder satisfies a predetermined condition, and pass the message without scaling when the current operating condition does not satisfy the predetermined condition; and determine a valid codeword based on the exchanging.
 2. The decoder of claim 1, wherein the decoder being configured to scale the respective message comprises the decoder being configured to reduce a number of bits representing the message and the degree of reliability indicated by the message.
 3. The decoder of claim 1, wherein the plurality of messages comprise a plurality of log-likelihood ratios (LLRs) for a unit of data.
 4. The decoder of claim 3, wherein scaling the respective message comprises reducing a numerical range for a respective one of the LLRs.
 5. The decoder of claim 4, wherein scaling the respective message comprises right shifting a plurality of bits indicative of the respective one of the LLRs and truncating or rounding the respective one of the LLRs.
 6. The decoder of claim 3, wherein the decoder is further configured to: perform, during each iteration, a mathematical operation on each of the LLRs; and determine whether a respective one of the LLRs should be scaled at the end of the iteration, wherein, when the respective one of the LLRs is scaled, a next mathematical operation is performed on the scaled LLR.
 7. The decoder of claim 3, wherein the decoder being configured to scale the respective message when the current operating condition of the decoder satisfies a predetermined condition comprises the decoder being configured to determine that absolute values of a predetermined number of the plurality of LLRs are greater than a predetermined limit.
 8. The decoder of claim 3, wherein the decoder being configured to scale the respective message when the current operating condition of the decoder satisfies a predetermined condition comprises the decoder being configured to determine that a predetermined number of the plurality of iterations has been reached.
 9. The decoder of claim 8, wherein the predetermined number of the plurality of iterations is a predetermined number of the plurality of iterations since a prior scaling operation.
 10. The decoder of claim 3, wherein the decoder being configured to scale the respective message when the current operating condition of the decoder satisfies a predetermined condition comprises the decoder being configured to determine that a current number of unsatisfied checks on at least a portion of the plurality of messages exchanged between the plurality of variable nodes and the plurality of check nodes does not satisfy a predetermined threshold and a predetermined number of iterations have been performed since a prior scaling operation.
 11. A machine-implemented method comprising: exchanging, in a decoder during each of a plurality of iterations, a plurality of messages between a plurality of variable nodes and a plurality of check nodes, each message indicating a degree of reliability in an observed outcome of data; determining a current operating condition of the decoder; for each of a plurality of iterations: scaling the respective message when the current operating condition of the decoder satisfies a predetermined condition, and passing the message without scaling when the current operating condition does not satisfy the predetermined condition; and determining a valid codeword based on the exchanging.
 12. The machine-implemented method of claim 11, wherein scaling the respective message comprises reducing a number of bits representing the message and the degree of reliability indicated by the message.
 13. The machine-implemented method of claim 11, wherein the plurality of messages comprise a plurality of log-likelihood ratios (LLRs) for a unit of data.
 14. The machine-implemented method of claim 13, wherein scaling the respective message comprises reducing a numerical range for a respective one of the LLRs.
 15. The machine-implemented method of claim 14, wherein scaling the respective message comprises right shifting a plurality of bits indicative of the respective one of the LLRs and truncating or rounding the respective one of the LLRs.
 16. The machine-implemented method of claim 13, further comprising: performing, during each iteration, a mathematical operation on each of the LLRs; and determining whether a respective one of the LLRs should be scaled at the end of the iteration, wherein, when the respective one of the LLRs is scaled, a next mathematical operation is performed on the scaled LLR.
 17. The machine-implemented method of claim 13, wherein determining whether the respective one of the messages should be scaled based on a current operating condition of the decoder comprises: determining that absolute values of a predetermined number of the plurality of LLRs are greater than a predetermined limit.
 18. The machine-implemented method of claim 13, wherein determining whether the respective one of the messages should be scaled based on a current operating condition of the decoder comprises: determining that a predetermined number of the plurality of iterations has been reached.
 19. The machine-implemented method of claim 18, wherein the predetermined number of the plurality of iterations is a predetermined number of the plurality of iterations since a prior scaling operation.
 20. The machine-implemented method of claim 13, wherein determining whether the respective one of the messages should be scaled based on a current operating condition of the decoder comprises: determining that a current number of unsatisfied checks on at least a portion of the plurality of messages exchanged between the plurality of variable nodes and the plurality of check nodes does not satisfy a predetermined threshold and a predetermined number of iterations have been performed since a prior scaling operation. 